Search results for "Gas meter prover"
showing 2 items of 2 documents
Numerical decomposition of geometric constraints
2005
Geometric constraint solving is a key issue in CAD/CAM. Since Owen's seminal paper, solvers typically use graph based decomposition methods. However, these methods become difficult to implement in 3D and are misled by geometric theorems. We extend the Numerical Probabilistic Method (NPM), well known in rigidity theory, to more general kinds of constraints and show that NPM can also decompose a system into rigid subsystems. Classical NPM studies the structure of the Jacobian at a random (or generic) configuration. The variant we are proposing does not consider a random configuration, but a configuration similar to the unknown one. Similar means the configuration fulfills the same set of inci…
Finite State Verifiers with Constant Randomness
2012
We give a new characterization of NL as the class of languages whose members have certificates that can be verified with small error in polynomial time by finite state machines that use a constant number of random bits, as opposed to its conventional description in terms of deterministic logarithmic-space verifiers. It turns out that allowing two-way interaction with the prover does not change the class of verifiable languages, and that no polynomially bounded amount of randomness is useful for constant-memory computers when used as language recognizers, or public-coin verifiers.